Minimizing the Total Weighted Completion Time of a Single Machine With Flexible Maintenance

Minimizing total weighted completion time approximately for the parallel machine problem with a single server

In this paper, we consider the scheduling problem of minimizing total weighted job completion time when a set of jobs has to be processed on a set of m parallel identical machines with a common server. We propose an approximation algorithm with a worst-case ratio of 3− 1 m . This result improves an existing (5− 1 m ) approximation algorithm given by Wang and Cheng (2001).

An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint

In this paper we study the classical scheduling problem of minimizing the total weighted completion time on a single machine with the constraint that one specific job must be scheduled at a specified position. We give dynamic programs with pseudo-polynomial running time, and a fully polynomial-time approximation scheme (FPTAS). 1998 ACM Subject Classification F.2.2

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

1Laboratory of Algorithms and Technologies for Networks Analysis National Research University Higher School of Economics 136 Rodionova street, Niznhy Novgorod 603093, Russia 2Department of Industrial and Systems Engineering, University of Florida 303 Weil Hall, Gainesville, FL, 32611, USA 3Department of Operations Management & Operations Research, University of Groningen Nettelbosje 2, 9747 AE ...

Single Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost

In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certain jobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (1) minimization ...

Two agents single machine scheduling problem with total completion time and total weighted completion time objectives